4 Random combinatorial structures : the convergent case
نویسنده
چکیده
This paper studies the distribution of the component spectrum of combinatorial structures such as uniform random forests, in which the classical generating function for the numbers of (irreducible) elements of the different sizes converges at the radius of convergence; here, this property is expressed in terms of the expectations of independent random variables Zj , j ≥ 1, whose joint distribution, conditional on the event that ∑n j=1 jZj = n, gives the distribution of the component spectrum for a random structure of size n. For a large class of such structures, we show that the component spectrum is asymptotically composed of Zj components of small sizes j, j ≥ 1, with the remaining part, of size close to n, being made up of a single, giant component.
منابع مشابه
1 M ay 2 00 3 Random combinatorial structures : the convergent case
This paper studies the distribution of the component spectrum of combinatorial structures such as uniform random forests, in which the classical generating function for the numbers of (irreducible) elements of the different sizes converges at the radius of convergence; here, this property is expressed in terms of the expectations of independent random variables Z j , j ≥ 1, whose joint distribu...
متن کاملRandom combinatorial structures: the convergent case
This paper studies the distribution of the component spectrum of combinatorial structures such as uniform random forests, in which the classical generating function for the numbers of (irreducible) elements of the different sizes converges at the radius of convergence; here, this property is expressed in terms of the expectations of independent random variables Zj , j ≥ 1, whose joint distribut...
متن کاملA Deterministic Multiple Key Space Scheme for Wireless Sensor Networks via Combinatorial Designs
The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. To do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (MKSS). In the MKSS, the authors define two random parameters to make better resilience than existing schemes. Instead of a random selection of these parame...
متن کاملBoltzmann Oracle for Combinatorial Systems
The recent discovery of Boltzmann samplers by Duchon, Flajolet, Louchard and Schaeffer [5] brought a considerable progress to the area of random generation of combinatorial structures. For wide families of classes of structures defined recursively, it is possible to construct automatically efficient random generators (samplers). These generators can produce large structures with the property th...
متن کاملRandom Generation of Unlabelled Combinatorial Structures
A systematic method for generating unlabelled combinatorial structures uniformly at random is presented. It applies to structures that are decomposable, i.e., formally speciiable by grammars involving unions, products, sequences, multisets and cycles. All such structures of size n can be generated uniformly by either sequential algorithms of worst-case arithmetic complexity O(n 2) or by \boustr...
متن کامل